dfs and similar math sortings *1400

Please click on ads to support us..

Python Code:


n=int(input())
a=list(map(int,input().split()))

next=[-1]*n
used=[0]*n
for i in range(n):
    for j in range(n):
        if 2*a[i]==a[j] or a[i]==a[j]*3:
            next[i]=j
            used[j]=1
            break


x=used.index(0)
while x>=0:
    print(a[x],end=" ")
    x=next[x]
print()


Comments

Submit
0 Comments
More Questions

1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract
490C - Hacking Cypher
158B - Taxi
41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array